Fast Fractal Image Compression Scheme

نویسنده

  • Sugandha Sharma
چکیده

Compression and decompression tools of digital image has become a significant aspect in the storing and transferring of digital image. Fractal image compression technique is recently used to compress images. The main problem with fractal image compression is that it takes a lot of computational time for searching blocks (domain block and range block) and then compares these blocks. There are many optimization techniques which are used to improve efficiency of fractal image compression. Some of these are particle swarm optimization, ant colony optimization and biogeography based optimization. In this paper the technique of biogeography based optimization (BBO) is applied for fractal image compression (FIC).With the help of this evolutionary algorithm effort is made to reduce the search complexity of matching between range block and domain block. The main drawback of FIC is that it involves more computational time due to global search. In order to improve the computational time and also the satisfactory quality of the decoded image, BBO algorithm is proposed. Investigational outcome show that the BBO is a better method than the traditional comprehensive search method in terms of encoding time. Results are calculated from wavelet based fractal image compression than BBO is applied over it to decrease the encode time and get better visual quality of image. In this paper compression time (encoding time) of fractal image compression is reduced.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Fractal Image Compression Techniques

Image compression is an essential technology in multimedia and digital communication fields. Fractal image compression is a potential image compression scheme due to its potential high compression ratio, fast decompression and multi resolution properties. Fractal image compression utilizes the existence of self symmetry of images. Since Bransley gave the concept of fractal image compression in ...

متن کامل

Codebook Clustering by Self-organizing Maps for Fractal Image Compression

A fast encoding scheme for fractal image compression is presented. The method uses a clustering algorithm based on Kohonen's self-organizing maps. Domain blocks are clustered, yielding a classiication with a notion of distance which is not given in traditional classiication schemes.

متن کامل

Use of Wavelets in Fractal Compression Algorithm for Enhanced Performance

Fractal coding suffered from low coding efficiency, difficulties to obtain high quality encoding of images, and blocking artifacts at low bit rates and exhaustive inherent coding time. Blocking artifacts can be avoided if fractal coding is performed in the wavelet domain. A new fast and efficient image coder is developed that applies the speed of the wavelet transform to the image quality of th...

متن کامل

Codebook Clustering by Self-organizing Maps for Fractal Image Compression Institut F Ur Informatik | Report 75 1

A fast encoding scheme for fractal image compression is presented. The method uses a clustering algorithm based on Kohonen's self-organizing maps. Domain blocks are clustered, yielding a classi cation with a notion of distance which is not given in traditional classi cation schemes.

متن کامل

A Fast Fractal Image Coding Approach Employing Fuzzy Aggregation of Domain Blocks

Fractal image compression is a class of image compression techniques that offer the advantages of high compression ratio and fast decoding. But the major obstacle of these techniques is the relatively long time needed for encoding the image due to the requirement of search for the best fitting domain block for each range block. Various methods have been suggested to overcome this problem withou...

متن کامل

Fractal Image Compression with Adaptive Quardtree Partitioning

The image partitioning scheme in fractal image compression is one of the important aspect for enhancement of performance. In this paper, an adaptive quardtree partitioning scheme is proposed where the entire image is sub-divided recursively into four sub-images. The partitioning points are selected adaptively in a image context-dependent way instead of middle points of the image sides as in qua...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2012